Delegation in Predicate Encryption Supporting Disjunctive Queries

نویسندگان

  • Dongdong Sun
  • Colin Boyd
  • Juan Manuel González Nieto
چکیده

Predicate encryption has an advantage over traditional publickey or identity-based encryption, since predicate encryption systems provide more flexible control over access to encrypted data. We focus on delegation capabilities in predicate systems. More specifically, we investigate delegatable encryption systems supporting disjunctive predicate evaluations. We present formal security definitions of delegatable predicate encryption and provide the first delegatable predicate encryption scheme which supports disjunctive predicate evaluations in the publickey setting. We analyze the security of the proposed system and give a security proof.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Predicates over Encrypted Data

Predicate encryption is a new encryption paradigm where the secret key owner can perform fine-grained access control over the encrypted data. In particular, the secret key owner can generate a capability corresponding to a query predicate (e.g., whether an encrypted email contains the keyword MEDICAL), and the capability allows one to evaluate the outcome of this predicate on the encrypted data...

متن کامل

Delegating Capabilities in Predicate Encryption Systems

In predicate encryption systems, given a capability, one can evaluate one or more predicates on the encrypted data, while all other information about the plaintext remains hidden. We consider the first such systems to permit delegation of capabilities. In a system that supports delegation, a user Alice who has a capability can delegate to Bob a more restrictive capability, which allows him to l...

متن کامل

Predicate Encryption with Various Properties

Predicate encryption (PE) is a new primitive which supports flexible control over access to encrypted data. In PE schemes, users’ decryption keys are associated with predicates f and ciphertexts encode attributes a that are specified during the encryption procedure. A user can successfully decrypt if and only if f(a) = 1. In this thesis, we will investigate several properties that are crucial t...

متن کامل

Symmetric Encryption with E cient Keyword Search

Security and e ciency are widely recognized as important requirements for query on encrypted data in the cloud environment. In this paper we propose e cient searchable symmetric encryption (named ESSE) schemes that support binary search and achieve both plaintext privacy and predicate privacy. Firstly, we present an idea that constructing a searchable symmetric encryption scheme that has capabi...

متن کامل

Optimization and Evaluation of Disjunctive Queries

ÐIt is striking that the optimization of disjunctive queriesÐi.e., those which contain at least one or-connective in the query predicateÐhas been vastly neglected in the literature, as well as in commercial systems. In this paper, we propose a novel technique, called bypass processing, for evaluating such disjunctive queries. The bypass processing technique is based on new selection and join op...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010